- complete embedding
- мат.полное вложение
English-Russian scientific dictionary. 2008.
English-Russian scientific dictionary. 2008.
Complete graph — K7, a complete graph with 7 vertices Vertices n Edges … Wikipedia
Graph embedding — In topological graph theory, an embedding of a graph G on a surface Sigma; is a representation of G on Sigma; in which points of Sigma; are associated to vertices and simple arcs (homeomorphic images of [0,1] ) are associated to edges in such a… … Wikipedia
Whitney embedding theorem — In mathematics, particularly in differential topology,there are two Whitney embedding theorems:*The strong Whitney embedding theorem states that any connected smooth m dimensional manifold (required also to be Hausdorff and second countable) can… … Wikipedia
Book embedding — In graph theory, book embedding is a generalization of planar embedding to nonplanar surfaces in the form of a book , a collection of pages (halfplanes) joined together at the spine of the book (the shared boundary of all the halfplanes). The… … Wikipedia
Model complete theory — In model theory, a first order theory is called model complete if every embedding of models is an elementary embedding. Equivalently, every first order formula is equivalent to a universal formula. This notion was introduced by Abraham Robinson.… … Wikipedia
List of NP-complete problems — Here are some of the more commonly known problems that are NP complete when expressed as decision problems. This list is in no way comprehensive (there are more than 3000 known NP complete problems). Most of the problems in this list are taken… … Wikipedia
interstitial implantation — complete embedding of a blastocyst within the endometrium, as in humans … Medical dictionary
Differential geometry of surfaces — Carl Friedrich Gauss in 1828 In mathematics, the differential geometry of surfaces deals with smooth surfaces with various additional structures, most often, a Riemannian metric. Surfaces have been extensively studied from various perspectives:… … Wikipedia
Edge coloring — A 3 edge coloring of the Desargues graph. In graph theory, an edge coloring of a graph is an assignment of “colors” to the edges of the graph so that no two adjacent edges have the same color. For example, the figure to the right shows an edge… … Wikipedia
Planar graph — Example graphs Planar Nonplanar Butterfly graph K5 The complete graph K4 … Wikipedia
Cyclic order — In mathematics, a cyclic order is a way to arrange a set of objects in a circle.[nb] Unlike most structures in order theory, a cyclic order cannot be modeled as a binary relation a < b . One does not say that east is more clockwise than west.… … Wikipedia